Graph learning is a popular approach for performing machine learning on graph-structured data. It has revolutionized the machine learning ability to model graph data to address downstream tasks. Its application is wide due to the availability of graph data ranging from all types of networks to information systems. Most graph learning methods assume that the graph is static and its complete structure is known during training. This limits their applicability since they cannot be applied to problems where the underlying graph grows over time and/or new tasks emerge incrementally. Such applications require a lifelong learning approach that can learn the graph continuously and accommodate new information whilst retaining previously learned knowledge. Lifelong learning methods that enable continuous learning in regular domains like images and text cannot be directly applied to continuously evolving graph data, due to its irregular structure. As a result, graph lifelong learning is gaining attention from the research community. This survey paper provides a comprehensive overview of recent advancements in graph lifelong learning, including the categorization of existing methods, and the discussions of potential applications and open research problems.

Understanding the facial expressions of our interlocutor is important to enrich the communication and to give it a depth that goes beyond the explicitly expressed. In fact, studying one's facial expression gives insight into their hidden emotion state. However, even as humans, and despite our empathy and familiarity with the human emotional experience, we are only able to guess what the other might be feeling. In the fields of artificial intelligence and computer vision, Facial Emotion Recognition (FER) is a topic that is still in full growth mostly with the advancement of deep learning approaches and the improvement of data collection. The main purpose of this paper is to compare the performance of three state-of-the-art networks, each having their own approach to improve on FER tasks, on three FER datasets. The first and second sections respectively describe the three datasets and the three studied network architectures designed for an FER task. The experimental protocol, the results and their interpretation are outlined in the remaining sections.

在本文中，我们解决了诱导的半监督学习问题，旨在获取样本数据的标签预测。所提出的方法称为最优传输诱导（OTI），有效地将最佳的传输基于传输的转换算法（OTP）扩展到二进制和多级设置的归纳任务。在多个数据集上进行一系列实验，以便将所提出的方法与最先进的方法进行比较。实验证明了我们方法的有效性。我们将我们的代码公开使用（代码可供选择：https://github.com/mouradelhamri/oti）。

在本文中，我们提出了一种对无监督域适应的新方法，与最佳运输，学习概率措施和无监督学习的概念相关。所提出的方法Hot-DA基于最佳运输的分层制定，其利用了由地面度量捕获的几何信息，源和目标域中的结构信息更丰富的结构信息。通过根据其类标签将样本分组到结构中，本质地形成标记的源域中的附加信息。在探索未标记的目标域中的隐藏结构的同时，通过Wassersein BaryCenter的学习概率措施的问题，我们证明是等同于光谱聚类。具有可控复杂性的玩具数据集的实验和两个具有挑战性的视觉适应数据集显示了所提出的方法的优越性。